List-colouring the square of an outerplanar graph
نویسندگان
چکیده
It is proved that if G is a K2,3-minor-free graph with maximum degree ∆, then ∆ + 1 6 χ(G) 6 ch(G) 6 ∆ + 2 if ∆ > 3, and ch(G) = χ(G) = ∆ + 1 if ∆ > 6. All inequalities here are sharp, even for outerplanar graphs.
منابع مشابه
List-colourings of Near-outerplanar Graphs
A list-colouring of a graph is an assignment of a colour to each vertex v from its own list L(v) of colours. Instead of colouring vertices we may want to colour other elements of a graph such as edges, faces, or any combination of vertices, edges and faces. In this thesis we will study several of these different types of list-colouring, each for the class of a near-outerplanar graphs. Since a g...
متن کاملGame colouring of the square of graphs
This paper studies the game chromatic number and game colouring number of the square of graphs. In particular, we prove that if G is a forest of maximum degree ∆ ≥ 9, then χg(G ) ≤ colg(G ) ≤ ∆+3, and there are forestsG with colg(G ) = ∆+3. It is also proved that for an outerplanar graph G of maximum degree ∆, χg(G ) ≤ colg(G ) ≤ 2∆ + 14, and for a planar graph G of maximum degree ∆, χg(G ) ≤ c...
متن کاملFrugal Colouring of Graphs
A k-frugal colouring of a graph G is a proper colouring of the vertices of G such that no colour appears more than k times in the neighbourhood of a vertex. This type of colouring was introduced by Hind, Molloy and Reed in 1997. In this paper, we study the frugal chromatic number of planar graphs, planar graphs with large girth, and outerplanar graphs, and relate this parameter with several wel...
متن کاملOn Coloring Squares of Outerplanar Graphs
We study vertex colorings of the square G of an outerplanar graph G. We find the optimal bound of the inductiveness, chromatic number and the clique number of G as a function of the maximum degree ∆ of G for all ∆ ∈ N. As a bonus, we obtain the optimal bound of the choosability (or the list-chromatic number) of G when ∆ ≥ 7. In the case of chordal outerplanar graphs, we classify exactly which g...
متن کاملStrong edge-colouring and induced matchings
A strong edge-colouring of a graph G is a proper edge-colouring such that every path of three edges uses three colours. An induced matching of a graph G is a subset I of edges of G such that the graph induced by the endpoints of I is a matching. In this paper, we prove the NP-completeness of strong 4, 5, and 6-edge-colouring and maximum induced matching in some subclasses of subcubic triangle-f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Ars Comb.
دوره 101 شماره
صفحات -
تاریخ انتشار 2011